On the forward algorithm for stopping problems on continuous-time Markov chains
نویسندگان
چکیده
Abstract We revisit the forward algorithm, developed by Irle, to characterize both value function and stopping set for a large class of optimal problems on continuous-time Markov chains. Our objective is renew interest in this constructive method showing its usefulness solving some constrained that have emerged recently.
منابع مشابه
Forward-reverse EM algorithm for Markov chains
We develop an EM algorithm for estimating parameters that determine the dynamics of a discrete time Markov chain evolving through a certain measurable state space. As a key tool for the construction of the EM method we develop forward-reverse representations for Markov chains conditioned on a certain terminal state. These representations may be considered as an extension of the earlier work [1]...
متن کاملContinuous Time Markov Chains
Discrete-time Markov chains are useful in simulation, since updating algorithms are easier to construct in discrete steps. They can also be useful as crude models of physical, biological, and social processes. However, in the physical and biological worlds time runs continuously, and so discrete-time mathematical models are not always appropriate. This is especially true in population biology –...
متن کاملAn EM Algorithm for Continuous-time Bivariate Markov Chains
We study properties and parameter estimation of finite-state homogeneous continuous-time bivariate Markov chains. Only one of the two processes of the bivariate Markov chain is observable. The general form of the bivariate Markov chain studied here makes no assumptions on the structure of the generator of the chain, and hence, neither the underlying process nor the observable process is necessa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2021
ISSN: ['1475-6072', '0021-9002']
DOI: https://doi.org/10.1017/jpr.2021.11